Location:
Search - Java Node
Search list
Description: 用Java编写的二叉树的数据结构，包括二叉树的每个节点的值，以及各子树的指针。 -Java prepared by the binary tree data structures, including binary tree each node values, and the subtree target.
Platform: |
Size: 1232 |
Author: yxl |
Hits:
Description: 用Java编写的二叉树的数据结构，包括二叉树的每个节点的值，以及各子树的指针。 -Java prepared by the binary tree data structures, including binary tree each node values, and the subtree target.
Platform: |
Size: 1024 |
Author: yxl |
Hits:
Description: 画图工具L c R G NONE End Enum Dim graph As Graphic Private Type Lnode’定义一个节点类型来 保存每个图形的信息 Sx As Single Sy As Single Tx As Single Ty As Single Bch As Graphic Color As Long End Type 画图:直线,圆跟矩形都用Line方法来实现,封装在Public Sub-drawing tools c R L G NONE End Enum Dim graph As Graphic Private Type Lnode 'definition of a node to preserve each type of graphical information Sx As Sy As Single Single Single Tx As Ty As Single Bch As Long As Graphic Color End Type Painting : linear , round rectangle with both methods to achieve Line, the Public Sub Packaging
Platform: |
Size: 31744 |
Author: 魏衍斌 |
Hits:
Description: 这是一个用DOM实现的XML分析器，图形化界面。能够实现对XML文档的树形输出，并且能够对XML文档进行插入以及修改。-This is a XML Parser based on DOM in GUI.
It can realize the Tree-output for a specficied XML file, and insert or modift the XML node in this file.
Platform: |
Size: 19456 |
Author: 余标 |
Hits:
Description: Swilet是一个j2ee web表示层架构，可以帮助程序开发者在不需要掌握ajax或javascript知识的情况下，就能快速开发有ajax特性的网站应用。 Swilet将java Swing程序转换为j2ee web 程序。所以程序开发者可以利用现有的自己熟悉的开发工具，开发Swing程序，通过Swilet框架，将其转化为web程序。 Swilet支持swing中的大部分标准控件，包括一些在web中没有的控件。如动态读取节点的树控件、可以编辑的表格、分页tab控件、各种单选多选菜单等。而且这些复杂控件的使用，并不需要掌握额外的javascript、html、css等知识，只要您掌握了标准swing api中的这些控件的使用方法，这些控件就会自动呈现到html页面中-Swilet creates is a layer of the web said, to help developers master the need ajax javascript knowledge or circumstances, there will be rapid development ajax characteristics of Web applications. Java Swing Swilet procedures will be converted to procedure creates web. Therefore, developers can use their existing familiar with the development of tools to develop Swing procedures, through Swilet framework into its procedures for the web. Swilet swing support most of the standard controls, including some not in the web of controls. Readers such as dynamic node tree controls, can edit forms, tab tab controls various danxuan choose menu. But these complex controls, and not acquire additional javascript, html, css knowledge, as long as you master the standard api swing control of the use of thes
Platform: |
Size: 4098048 |
Author: ma |
Hits:
Description: 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...
Platform: |
Size: 10240 |
Author: 丁如敏 |
Hits:
Description: 最短路径算法的一种高效实现。适合在节点密集的环境中找两点之间的最短路径。-shortest path algorithm to achieve a highly efficient. Suitable for the node-intensive environment between 2:00 find the shortest path.
Platform: |
Size: 3072 |
Author: |
Hits:
Description: XML API,将XML结点返回HASHMAP,对于一般配置性XML解析比较方便,也实用-XML API, the XML node to return HASHMAP, the general configuration of XML for Analysis of more convenient, but also practical
Platform: |
Size: 159744 |
Author: xinsoft |
Hits:
Description: 生成BA 小世界网络java 源程序，里面涉及到结点类RipplePeer可以另行自己实现，主要就是几个成员变量id，neighbors数组（与之连接的结点）和degree度数-BA small-world networks generated java source code, which relates to node can be its own category RipplePeer realize, the main variable is the number of members of id, neighbors array (connected nodes) and degree degrees
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 是数据一次性加载，客户端节点异步展示的WEB脚本树。MzTreeView 1.0 的理论节点数设计上限为十万节点，在节点数三万的情况下页面打开时间小于 3 秒。无限层次无限节点的数的层级组成方式：id parentId。即每个节点除本身的节点id之外还有它的父层节点id，通过这种方式就可以组合成无限层级的树了。-Is a one-time load data, the client node to display the WEB asynchronous script tree. MzTreeView 1.0 theoretical maximum number of nodes in the design of hundreds of thousands of nodes, number of nodes in the case of 30,000 pages open time of less than 3 seconds. Unlimited levels of unlimited number of node-level composition: id parentId. That is, each node in addition to its own node id in addition to its parent layer node id, in this way can be combined into an unlimited level of the tree.
Platform: |
Size: 856064 |
Author: floy |
Hits:
Description: 一个很好的jTree的例子，把JTree嵌在了网页上面，通过XML读取树的节点-JTree a good example of the JTree embedded in the page above, read through the XML tree node
Platform: |
Size: 18432 |
Author: yue |
Hits:
Description: 树型工具条的应用，实现了点击节点可以读取数据并在视图上画图的功能。-Tree toolbar application realize the click node can read the data and in view of the drawing functions.
Platform: |
Size: 3840000 |
Author: 魏无际 |
Hits:
Description: 动态演示各种数据结构的定义和操作:
实现过程:
建立一棵二叉树，并在所建立的二叉树中可在任意结点位置插入其左右孩子。
画出你所建的这棵二叉树，并能动态反映你所插结点的过程（具有可视化，彩色，美观的效果）
能查找任一结点的左右孩子
能查找任一结点的左右邻兄弟
能查找任一结点的父亲
能删除任一结点
能对树进行各种遍历-Dynamic demonstration of the definition of various data structures and operations: the realization of the process: the establishment of a binary tree and binary tree created can be in any position to insert node about its children. Draw your tree built binary tree, and you can dynamically reflect the process of interpolation nodes (with a visualization, color, aesthetic effects) can search any one node around children can search for any node o brothers around the search term can be the father of one node can delete any node can conduct various kinds of tree traversal
Platform: |
Size: 13312 |
Author: 许磊 |
Hits:
Description: 基于P2P结构的无线网格资源发现机制.pdf
针对无线网络的特殊环境,提出了一种基于P2P 结构的无线网格资源发现机制,该机制结合了分布式
与集中式网格资源发现的优点,引入了超级节点的概念,通过超级节点管理域内用户,将资源信息存放在超级
节点中,避免了中央节点聚合目录的更新. 并在此机制基础上给出了一个无线网格信息服务架构,满足了无线
网格资源发现的分散性和可扩展性的特点. 理论分析和实验证明能够提高无线网格资源发现效率.-Based on the structure of a wireless P2P Grid Resource Discovery Mechanism. Pdf for the unique environment of the wireless network, a P2P-based wireless mesh structure resource discovery mechanism, which combines the distributed and centralized grid resource discovered the advantages of introduced the concept of super-node, through the super-node management region users, resource information will be stored in the super-node, to avoid polymerization of the central node of the updated directory. and in this mechanism is given based on a wireless mesh architecture information services to meet the a wireless mesh decentralized resource discovery and scalability characteristics. theoretical analysis and experimental results prove that wireless mesh to improve the efficiency of resource discovery.
Platform: |
Size: 243712 |
Author: yinlu |
Hits:
Description: 1. 用一个一维数组保存二叉树结点。
2. 实现二叉树节点的返回左孩子，返回右孩子，添加结点
3. 层序遍历二叉树。
-1. With a one-dimensional array to preserve binary tree nodes. 2. The realization of binary tree nodes to return to the left child, return the right child, add the node 3. Binary tree traversal sequence.
Platform: |
Size: 1024 |
Author: fangxuerong |
Hits:
Description: 迄今为止见过的最方便的huffman编码，效率很高
一个外国人写的，很具有研究价值
Constructing a Huffman Tree according to the number of times each symbol appears in the data stream:
1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1).
2) Set the value of each node to the number of times that its symbol appears in the data stream.
3) Create a Minimum-Heap of N nodes.
4) Add every node whose value is greater than zero to the heap.
5) Extract the best two nodes in the heap.
6) Create a parent node whose children are the two extracted nodes.
7) Add the parent node to the heap.
8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap).
9) Extract the last node in the heap.
The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.
The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes , representing N possible symbols (ranging between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.
Platform: |
Size: 17408 |
Author: 游弋人生 |
Hits:
Description: Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。
-Dijkstra algorithm is a typical example of the most short-circuit algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the date extended to the end. Dijkstra shortest path algorithm can arrive at the optimal solution, but because it traverse a lot of computing nodes, so inefficient. Dijkstra algorithm is a step by step search algorithm for each vertex n reservations so far found from the m to n shortest path to work.
Platform: |
Size: 1024 |
Author: kivilin |
Hits:
Description: 这是一个结点的操作，用java作为开发环境，用线性表作为数据结构-This is a node of the operation, using java as a development environment, using a linear form as a data structure
Platform: |
Size: 1024 |
Author: 周祥 |
Hits:
Description: networking code for 1 node
Platform: |
Size: 23552 |
Author: Lithin |
Hits:
Description: 《阿里巴巴 Java 开发手册》是阿里巴巴集团技术团队的集体智慧结晶和经验总
结， 经历了多次大规模一线实战的检验及不断的完善， 系统化地整理成册， 回馈给广
大开发者。 现代软件行业的高速发展对开发者的综合素质要求越来越高， 因为不仅是
编程知识点，其它维度的知识点也会影响到软件的最终交付质量。(The Alibaba Java development manual is the collective wisdom and experience of the Alibaba group's technical team
Node, experienced a number of large-scale inspection and front-line combat constantly improve, to the compilation system, back to Guangzhou
Big developer. The rapid development of the modern software industry requires more and more comprehensive quality of the developers, because not only is the development of the developers more and more high.
Programming knowledge points, and other dimensions of knowledge points can also affect the final delivery quality of the software.)
Platform: |
Size: 1002496 |
Author: www2020 |
Hits: